3-approximation Algorithm for the Travelling Repairman Problem with Unit Time-windows
نویسندگان
چکیده
The travelling repairman problem (TRP) is a scheduling problem in which a repairman must visit locations to perform some task. Each location has a time window in which the repairman is allowed to arrive. The objective of this problem is to maximize the number of tasks performed. In this paper, we consider a special case in which all the locations are on a straight line, the tasks have no processing time, and all time-windows are of unit length. We present an improvement on the analysis of the 4-approximation algorithm presented by S. L. Pérez Pérez et al. in 2014.
منابع مشابه
Speedup in the Traveling Repairman Problem with Unit Time Windows
The input to the unrooted traveling repairman problem is an undirected metric graph and a subset of nodes, each of which has a time window of unit length. Given that a repairman can start at any location, the goal is to plan a route that visits as many nodes as possible during their respective time windows. A polynomial-time bicriteria approximation algorithm is presented for this problem, gain...
متن کاملOn Salesmen, Repairmen, Spiders, and Other Traveling Agents
The Traveling Salesman Problem (TSP) is a classical problem in discrete optimization. Its paradigmatic character makes it one of the most studied in computer science and operations research and one for which an impressive amount of algorithms (in particular heuristics and approximation algorithms) have been proposed. While in the general case the problem is known not to allow any constant ratio...
متن کاملOn Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract
We study a scheduling problem in which jobs have locations. For example, consider a repairman that is supposed to visit customers at their homes. Each customer is given a time window during which the repairman is allowed to arrive. The goal is to find a schedule that visits as many homes as possible. We refer to this problem as the Prize-Collecting Traveling Salesman Problem with time windows (...
متن کاملSpeedup in the Traveling Repairman Problem with Constrained Time Windows
A bicriteria approximation algorithm is presented for the unrooted traveling repairman problem, realizing increased profit in return for increased speedup of repairman motion. The algorithm generalizes previous results from the case in which all time windows are the same length to the case in which their lengths can range between l and 2. This analysis can extend to any range of time window len...
متن کاملOn approximating a geometric prize-collecting traveling salesman problem with time windows
We study a scheduling problem in which jobs have locations. For example, consider a repairman that is supposed to visit customers at their homes. Each customer is given a time window during which the repairman is allowed to arrive. The goal is to find a schedule that visits as many homes as possible. We refer to this problem as the prize-collecting traveling salesman problem with time windows (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Research in Computing Science
دوره 107 شماره
صفحات -
تاریخ انتشار 2015